Inversion polynomials for 321-avoiding permutations: addendum
نویسندگان
چکیده
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.
منابع مشابه
Inversion polynomials for 321-avoiding permutations
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin...
متن کاملInversion Formulae on Permutations Avoiding 321
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 321-avoiding permutations on [n] with m inversions is given by
متن کامل321-Polygon-Avoiding Permutations and Chebyshev Polynomials
A 321-k-gon-avoiding permutation π avoids 321 and the following four patterns: k(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · (k − 1)(k + 1), k(k + 2)(k + 3) · · · (2k − 1)(2k)12 · · · (k − 1)(k + 1), (k + 1)(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · k, (k + 1)(k + 2)(k + 3) · · · (2k − 1)(2k)123 · · · k. The 321-4-gon-avoiding permutations were introduced and studied by Billey and Warrington [BW]...
متن کاملMotzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduced decompositions. This characterization is used to construct a bijection for a recent result that the number of (321, 31̄42)-avoiding permutations of length n equals the n-th Motzkin number, due to Gire, and further studied by Barcucci, Del Lungo, Pergola, Pinzani and Guibert. Similarly, we obtain...
متن کامل1 1 Ju n 20 01 EXPLICIT ENUMERATION OF 321 , HEXAGON – AVOIDING PERMUTATIONS
The 321,hexagon–avoiding (321–hex) permutations were introduced and studied by Billey and Warrington in [4] as a class of elements of Sn whose Kazhdan– Lusztig and Poincaré polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7–term linear recurrence relation leading to an explicit enumeration of the 321–hex pe...
متن کامل